Randomized algorithms ; learning theory ; robust control 隨機(jī)化算法學(xué)習(xí)理論魯棒控制
Robust control design based on randomized algorithms 基于隨機(jī)化算法的魯棒控制器設(shè)計(jì)
Currently , there are mainly two kinds of research methods on this problem : meta - heuristics approach and randomized algorithms 目前,對(duì)于實(shí)體空間優(yōu)化擺放問(wèn)題,國(guó)內(nèi)外研究中所用的方法主要有兩種:用啟發(fā)式規(guī)則的方法以及用隨機(jī)算法求解。
This paper combines learning theory with robust control and discusses robust control design problems involving real parameter uncertainty in control systems based on randomized algorithms 將學(xué)習(xí)理論與魯棒控制相結(jié)合,采用隨機(jī)化算法針對(duì)實(shí)參數(shù)不確定系統(tǒng)討論了魯棒控制器的設(shè)計(jì)問(wèn)題。
Xu y . studies on randomized algorithms for sat problem and its phase transition phenomenon [ ph . d . thesis ] . hefei : university of science and technology ofchina , 2002 ( in chinese with english abstract ) 徐云. sat問(wèn)題的隨機(jī)算法及其相變現(xiàn)象研究[博士學(xué)位論文] .合肥:中國(guó)科學(xué)技術(shù)大學(xué), 2002
Then a suboptimal solution of the graph maximum equal - cut problem is presented employing the randomized algorithm and the improved coordinate ascent ( descent ) algorithm on the optimal solution of semidefmite relaxation 在利用lagrange乘子理論得出原始問(wèn)題的等價(jià)形式之后,將近似算法與改進(jìn)的坐標(biāo)上升(下降)算法結(jié)合,求得原問(wèn)題的次優(yōu)解。
It is shown that randomized algorithms can decrease the computational complexity dramatically instead of seeking worst case guarantees . in addition , examples in this paper show that employing randomized algorithms is very efficient and has obvious advantages especially when uncertain interval parameters appear multilinearly or nonlinearly in the characteristic polynomial coefficients 研究表明,在不考慮最壞情況的意義下,隨機(jī)化算法可以顯著降低計(jì)算復(fù)雜性,另外,當(dāng)不確定區(qū)間參數(shù)以多線性或非線性的方式出現(xiàn)在特征多項(xiàng)式系數(shù)中時(shí),采用隨機(jī)化算法具有明顯的優(yōu)點(diǎn)并且是非常有效的,文中給出了計(jì)算實(shí)例。
百科解釋
A randomized algorithm is an algorithm which employs a degree of randomness as part of its logic. The algorithm typically uses uniformly random bits as an auxiliary input to guide its behavior, in the hope of achieving good performance in the "average case" over all possible choices of random bits.